Classification of Linking Problem Types for Linking Semantic Data

As the number of RDF datasets published on semantic web continues to grow, it becomes increasingly important efficiently link similar entities between these datasets. However, performance existing data linking tools, often developed for general purposes, seems have reached a plateau, suggesting need more modular and efficient solutions. In this paper, we propose –and formalize in OWL– classification different Linking Problem Types (LPTs) help linked community identify upstream problems develop Our is based description heterogeneity reported literature –especially five articles– identifies main types problems: predicate value problems, class subgraph graph problems. By classifying LPTs, provide framework understanding addressing challenges associated with linking. It can be used new solutions modularized tools specific thus improving overall efficiency